An efficient procedure for mining statistically significant frequent itemsets
نویسندگان
چکیده
منابع مشابه
An Efficient Procedure for Mining Statistically Significant Frequent Itemsets
We suggest the original procedure for frequent itemsets generation, which is more efficient than the appropriate procedure of the well known Apriori algorithm. The correctness of the procedure is based on a special structure called Rymon tree. For its implementation, we suggest a modified sort-merge-join algorithm. Finally, we explain how the support measure, which is used in Apriori algorithm,...
متن کاملFrequent Itemsets Mining: An Efficient Graphical Approach
Recent advances in computer technology in terms of speed, cost, tremendous amount of computing power and decrease data processing time has spurred increased interest in data mining applications to extract useful knowledge from data. Over the last couple of years, data mining technology has been successfully employed to various business domains and scientific areas. Various data mining technique...
متن کاملEfficient Algorithms for Mining Share-frequent Itemsets
Itemset share has been proposed to evaluate the significance of itemsets for mining association rules in databases. The Fast Share Measure (FSM) algorithm is one of the best algorithms to discover all share-frequent itemsets efficiently. However, FSM is fast only when dealing with small datasets. In this study, we shall propose a revised version of FSM, called the Enhanced FSM (EFSM) algorithm ...
متن کاملCLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets
Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have proposed an interesting alternative: mining frequent closed itemsets and their corresponding rules, which has the same power as association mining but substantially reduces the number of rules to be presented. In this paper, we propose an e cient algorithm, CLOSET, for mi...
متن کاملDiffNodesets: An efficient structure for fast mining frequent itemsets
Mining frequent itemsets is an essential problem in data mining and plays an important role in many data mining applications. In recent years, some itemset representations based on node sets have been proposed, which have shown to be very efficient for mining frequent itemsets. In this paper, we propose DiffNodeset, a novel and more efficient itemset representation, for mining frequent itemsets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2010
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim1001109s